Combinatorial method for Boolean SAC functions designing
نویسنده
چکیده
In this paper a new approach for designing Boolean functions that satisfy the Strict Avalanche Criterion (SAC) is presented. The advantage of the suggested approach is the simplicity of its realization and the significant greater number of the generated functions compared to the known methods. The formalized procedure for construction of nonbalanced and balanced SAC-functions is described in detail; and examples of function design are given. Key-Words: Boolean functions, balance Boolean functions, SAC Boolean functions.
منابع مشابه
Methods for Design of Balanced Boolean Functions Satisfying Strict Avalanche Criterion (SAC)
In this paper two methods of designing Balanced Boolean functions for cryptographical transformations are presented. The first of them is based on using orthogonal nonlinear components. The second method realizes a combinatorial approach. Both methods provide high nonlinearity for the obtained functions and both of them operating with Algebraic Normal Form. The advantage of the first method is ...
متن کاملHow to Improve the SAC
This paper presents a simple yet effective method for transforming Boolean functions that do not satisfy the strict avalanche criterion (SAC) into ones that satisfy the criterion. Such a method has a wide range of applications in designing cryptographically strong functions, including substitution boxes (S-boxes) employed by common key block encryption algorithms.
متن کاملGeneralization of Higher Order SAC to Vector Output Boolean Functions
S-boxes (vector output Boolean functions) should satisfy cryptographic criteria even if some input bits (say, k bits) are kept constant. However, this kind of security has been studied only for scalar output Boolean functions. SAC(k) is a criterion for scalar output Boolean functions of this type. This paper studies a generalization of SAC(k) to vector output Boolean functions as the rst step t...
متن کاملCombinatorial method of polynomial expansion of symmetric Boolean functions
A novel polynomial expansion method of symmetric Boolean functions is described. The method is efficient for symmetric Boolean function with small set of valued numbers and has the linear complexity for elementary symmetric Boolean functions, while the complexity of the known methods for this class of functions is quadratic. The proposed method is based on the consequence of the combinatorial L...
متن کاملHeuristic Design of Cryptographically Strong Balanced Boolean Functions
1 I n t r o d u c t i o n It is well known that the resistance of a product cipher to modern cryptanalytic attacks such as linear and differential cryptanalysis [10,1] depends critically upon the nonlinearity of the Boolean functions comprising the round function. Typically these functions must be balanced, so there is considerable interest in the design of highly nonlinear balanced Boolean fun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004